Constructing Good Covering Codes for Applications in Steganography
نویسندگان
چکیده
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.
منابع مشابه
A Double Layered "Plus-Minus One" Data Embedding Scheme
In image steganography, a pixel can carry secret bits by choosing adding/subtracting one to/from the gray value. This kind of “ 1 steganography” can hide a longer message than simple LSB embedding. We propose a double-layered embedding method for implementing “ 1 steganography,” in which binary covering codes and wet paper codes are used to hide messages in the LSB plane and the second LSB plan...
متن کاملMaximizing Steganographic Embedding Efficiency by Combining Hamming Codes and Wet Paper Codes
For good security and large payload in steganography, it is desired to embed as many messages as possible per change of the coverobject, i.e., to have high embedding efficiency. Steganographic codes derived from covering codes can improve embedding efficiency. In this paper, we propose a new method to construct stego-codes, showing that not just one but a family of stego-codes can be generated ...
متن کاملEfficient Wet Paper Codes
Wet paper codes were proposed as a tool for constructing steganographic schemes with an arbitrary selection channel that is not shared between the sender and the recipient. In this paper, we describe new approaches to wet paper codes that enjoy low computational complexity and improved embedding efficiency (number of message bits per embedding change). Some applications of wet paper codes to st...
متن کاملNew Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کاملSteganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images
In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Trans. Data Hiding and Multimedia Security
دوره 3 شماره
صفحات -
تاریخ انتشار 2008